Classification of Task Partitioning and Load Balancing Strategies in Distributed Parallel Computing Systems
نویسندگان
چکیده
Distribution of the tasks amongst the various computing nodes is itself an intellectually challenging problem in the high performance distributed computing systems. To choose the appropriate strategy for the required system is difficult without the meaningful comparison of the existing task partitioning and load balancing strategies. The effectiveness of the strategy depend on the number of factors-efficiency, interconnection topology, communication mode, program structure, throughput and computing capabilities of the structure. A number of task partitioning and load balancing strategies have been proposed, each of which perform remarkable results under different circumstances. The main goal of the paper is to unravel the mystery of strategies and to classify when and where each strategy is appropriate. In this paper, taxonomy of task partitioning and load balancing is presented in an attempt to provide a common terminology and classification mechanism.
منابع مشابه
Load Balancing Strategies for Parallel SAMR Algorithms
Highly resolved solutions of partial differential equations are important in many areas of science and technology nowadays. Only adaptive mesh refinement methods reduce the necessary work sufficiently allowing the calculation of realistic problems. Blockstructured SAMR methods are well-suited for the time-explicit computation of large-scale dynamical problems, but still require parallelization ...
متن کاملLoad Balancing Strategies for Distributedmemory
Load balancing in large parallel systems with distributed memory is a diicult task often innuencing the overall eeciency of applications substantially. A number of eecient distributed load balancing strategies have been developed in the recent years. Although they are currently not generally available as part of parallel operating systems, it is often not diicult to integrate them into applicat...
متن کاملParallel Classification on SMP Systems
This paper presents fast scalable decision-tree-based classification algorithms targeting shared-memory systems. The algorithms are based on the sequential SPRINT classifier and span the gamut of data and task parallelism. The data parallelism is based on attribute scheduling among processors. This is extended with task pipelining and dynamic load balancing to yield more efficient schemes. The ...
متن کاملA Dynamic Load Balancing Algorithm for a Heterogeneous Computing Environment
Heterogeneous computing opens up new challenges and opportunities in fields such as parallel processing, design of algorithms for applications, partitioning and mapping of parallel tasks, interconnection network technology and the design of heterogeneous programming environments. Lots of load balancing algorithms have been proposed and experimented with in the past years for homogeneous paralle...
متن کاملTask Partitioning and Load Balancing Strategy for Matrix Applications on Distributed System
In this paper, we present a load-balancing strategy (Adaptive Load Balancing strategy) for data parallel applications to balance the work load effectively on a distributed system. We study its impact on computation-hungry matrix multiplication application. The ALB strategy enhances the performance with features such as intelligent node selection, pre-task assignment, adaptive task sizing and bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012